Universal Quantum Gates
نویسندگان
چکیده
In this paper we study universality for quantum gates acting on qudits. Qudits are states in a Hilbert space of dimension d where d can be any integer ≥ 2. We determine which 2-qudit gates V have the properties (i) the collection of all 1-qudit gates together with V produces all n-qudit gates up to arbitrary precision, or (ii) the collection of all 1-qudit gates together with V produces all n-qudit gates exactly. We show that (i) and (ii) are equivalent conditions on V , and they hold if and only if V is not a primitive gate. Here we say V is primitive if it transforms any decomposable tensor into a decomposable tensor. We discuss some applications and also relations with work of other authors. 1. Statements of main results We determine which 2-qudit gates V have the property that all 1-qudit gates together with V form a universal collection, in either the approximate sense or the exact sense. Here d is an arbitrary integer ≥ 2. Our results are new for the case of qubits, i.e., d = 2 (which for many is the case of primary interest). We treat the case d > 2 as well because it is of independent interest and requires no additional work. Since Deutsch [3] found a universal gate (on 3 qubits), universal gates for qubits have been extensively studied. We mention in particular the papers [1], [2] [4], [5] and [6] which will be further discussed in §2. First we set up some notations. A qudit is a (normalized) state in the Hilbert space C. An n-qudit is a state in the tensor product Hilbert space H = (C) = C ⊗ · · · ⊗ C. The computational basis of H is the orthonormal basis given by the d classical n-qudits |i1i2 · · · in〉 = |i1〉 ⊗ |i2〉 ⊗ · · · ⊗ |in〉 (1.1) where 0 ≤ ij ≤ d− 1. The general state in H is a superposition
منابع مشابه
Learning robust pulses for generating universal quantum gates
Constructing a set of universal quantum gates is a fundamental task for quantum computation. The existence of noises, disturbances and fluctuations is unavoidable during the process of implementing quantum gates for most practical quantum systems. This paper employs a sampling-based learning method to find robust control pulses for generating a set of universal quantum gates. Numerical results ...
متن کاملUniversal Quantum Gates
For classical circuits, both {AND, NOT} and the single-gate set {NAND} are universal. To nd universal sets of quantum gates, we use the quantum circuit model, in which each gate is represented by a 2 by 2 unitary matrix. Composition of gates is done by multiplying these matrices. The space of operations generated by a set of gates is a subgroup of the unitary group U (2) (or SU (2), ignoring gl...
متن کاملA Simple Proof that Toffoli and Hadamard are Quantum Universal
Recently Shi [15] proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a ’classical’ set of gates quantum universal. In this note we give a few lines proof of this fact relying on Kitaev’s universal set of gates [11], and discu...
متن کاملAlgebras and universal quantum computations with higher dimensional systems
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and dis...
متن کاملUniversal Sets of Quantum Gates for Detected Jump-Error Correcting Quantum Codes
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into statistically independent reservoirs. The proposed universal quantum gates are constructed with the help of Heisenbergand Ising-type Hamiltonians acting on these phys...
متن کاملUniversal Fault-Tolerant Gates on Concatenated Stabilizer Codes
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of nontransversal, yet still fault-tolerant, gates that work directly on sma...
متن کامل